Lightweight Cryptographic Techniques for Automotive Cybersecurity
نویسندگان
چکیده
منابع مشابه
Lightweight 4x4 MDS Matrices for Hardware-Oriented Cryptographic Primitives
Linear diffusion layer is an important part of lightweight block ciphers and hash functions. This paper presents an efficient class of lightweight 4x4 MDS matrices such that the implementation cost of them and their corresponding inverses are equal. The main target of the paper is hardware oriented cryptographic primitives and the implementation cost is measured in terms of the required number ...
متن کاملLightweight Contracts for Safety-Critical Automotive Systems
Complex automotive systems are composed of subsystems and components in a deep hierarchy, often designed by different development partners or reused from preexisting projects. It is therefore a challenging task to break down requirements into sub-requirements fitting the scope of the subsystems and to simultaneously demonstrate that the integrated system fulfills both functional and safety requ...
متن کاملWG 2 - Lightweight Cryptographic Algorithms
Project co-funded by the European Commission within the 7th Framework Programme Dissemination Level PU Public X PP Restricted to other programme participants (including the Commission services) RE Restricted to a group specified by the consortium (including the Commission services) CO Confidential, only for members of the consortium (including the Commission services) The information in this do...
متن کاملCryptographic techniques
The public key cryptosystem published by Diffie and Hellman in 1976 is still of great interest today. Of the public key systems that have been proposed the RSA scheme of Rivest, Shamir and Adelman is of most current interest. We shall briefly describe this system (more can be found in references 2 and 7) and then describe a method to obtain suitable primes for use in the scheme. Disciplines Phy...
متن کاملProof Techniques for Cryptographic Processes
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantification over all possible contexts. Here, we focus on two such equivalences, namely may-testing and barbed equivalence, and investigate tractable proof methods for them. To this aim, we design an enriched labelled transi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Wireless Communications and Mobile Computing
سال: 2018
ISSN: 1530-8669,1530-8677
DOI: 10.1155/2018/1640167